Generating an LTAG out of a Principle-based Hierarchical Representation
نویسنده
چکیده
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We present and a tool that automatically generates the tree families of an LTAG. It starts from a compact hierarchical organization of syntactic descriptions that is linguistically motivated and carries out all the relevant combinations of linguistic phenomena.
منابع مشابه
Using default inheritance to describe LTAG
We present the results of an investigation into how the set of elementary trees of a Lexicalized Tree Adjoining Grammar can be represented in the lexical knowledge representation language DATR (Evans & Gazdar 1989a,b). The LTAG under consideration is based on the one described in Abeille et al. (1990). Our approach is similar to that of Vijay-Shanker & Schabes (1992) in that we formulate an inh...
متن کاملUsing FB-LTAG Derivation Trees to Generate Transformation-Based Grammar Exercises
Using a Feature-Based Lexicalised Tree Adjoining Grammar (FB-LTAG), we present an approach for generating pairs of sentences that are related by a syntactic transformation and we apply this approach to create language learning exercises. We argue that the derivation trees of an FB-LTAG provide a good level of representation for capturing syntactic transformations. We relate our approach to prev...
متن کاملBuilding Parallel LTAG for French and Italian
In this paper we view Lexicalized Tree Adjoining Grammars as the compilation of a more abstract and modular layer of linguistic description : t h e metagrammar (MG). MG provides a hierarchical representation of lexicosyntactic descriptions and principles that capture the well-formedness of lexicalized structures, expressed using syntactic functions. This makes it possible for a tool to compile ...
متن کاملA principle-based hierarchical representation of LTAGs
LTAGs Abstract Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We present a compact hierarchical organization of syntactic descriptions, that is linguistically motivated and a tool that automatically generates the tree families of an LTAG. The tool starts from the synta...
متن کاملUDRT-based Semantics Construction for LTAG
Lexicalized Tree Adjoining Grammars (LTAGs) [6] are tree rewriting systems consisting of a finite set of trees associated with lexical items, so-called elementary trees (etrees). Elementary trees represent extended projections of lexical items that encapsulate all their syntactic/semantic arguments. Due to this property, semantics construction in LTAG can be based on elementary trees as basic u...
متن کامل